1) American post-rock group 2) English invention 3) Formal language 4) Hypothetical computer 
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. The `Turing` machine was invented in 1936 .....
hypothetical computing device introduced in 1936 by the English mathematician and logician Alan M. Turing. Turing originally conceived the machine as ... [10 related articles]
An abstract model of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm. A Turing machine can be thought of as a black box that carries out a calculation of some kind on an input number. If the calculation reaches a conclusion, o...
A model of computation that uses an underlying finite-state automaton but also has an infinite tape to use as memory. Turing machines are capable of universal computation. 
[n] - a hypothetical computer with an infinitely long memory tape
noun a hypothetical computer with an infinitely long memory tape
a hypothetical device with a set of logical rules of computation: the concept is used in mathematical studies of the computability of numbers and in the mathematical theories of automata and computers.